منابع مشابه
Studies on Streaming
In Chaos chaos streaming, motility, and cytokinesis were inhibited nearly 100% for several hours by 2.5-5 mM sodium adenosine triphosphate (ATP)(1) added to culture fluid. All three effects were completely prevented by the addition of equimolar Mg(++) or Ca(++) ions but not Na(+) to the ATP/culture fluid solution. The effects of ATP were not reproduced by EDTA, EGTA, colchicine, or AMP. Sodium ...
متن کاملToxicological studies of pesticides on cytoplasmic streaming in Nitella.
In the present study, changes in velocity of cytoplasmic streaming in the giant internodal cells of Nitella for varying concentration of the pesticides, 2,4-D, dieldrin, malathion, methyl parathion and endosulfan, were measured. Marked decrease in the velocity of cytoplasmic streaming was found at the concentrations of 0.01, 0.1, 1, 10 and 100mM. Dieldrin was the most toxic to all the pesticide...
متن کاملFluorescence studies on modes of cytochalasin B and phallotoxin action on cytoplasmic streaming in Chara
Various investigations have suggested that cytoplasmic streaming in characean algae is driven by interaction between subcortical actin bundles and endoplasmic myosin. To further test this hypothesis, we have perfused cytotoxic actin-binding drugs and fluorescent actin labels into the cytoplasm of streaming Chara cells. Confirming earlier work, we find that cytochalasin B (CB) reversibly inhibit...
متن کاملLectures on Streaming Algorithms
• Standard stream model: m elements from universe of size n, come one by one. Goal: compute a function of stream. Constraints: (1) Limited space (working memory), sublinear in n and m. (2) Access data sequentially. (3) Process each element quickly. • Graph stream: elements of the stream are edges. Let n be the number of vertices. We have m = O(n 2). To be able to handle interesting functions, w...
متن کاملOn Parallelizing Streaming Algorithms
We study the complexity of parallelizing streaming algorithms (or equivalently, branching programs). If M(f) denotes the minimum average memory required to compute a function f(x1, x2, . . . , xn) how much memory is required to compute f on k independent streams that arrive in parallel? We show that when the inputs (updates) are sampled independently from some domain X and M(f) = Ω(n), then com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cell Biology
سال: 1969
ISSN: 1540-8140,0021-9525
DOI: 10.1083/jcb.40.1.160